Efficient Digital Signatures From Coding Theory

The design of an efficient code-based signature scheme is by all means still an open problem. In this paper, we propose a simple and efficient scheme following a framework introduced by Lyubashevsky to construct a digital signature scheme from an identification scheme. The scheme is based on quasi-cyclic codes and, while security relies on the ring algebra that is associated with them, the proposal benefits from the quasi-cyclic structure in reducing key and signature sizes.